The role of data mining in turning bio-data into Bioinformation

ISSN 0973-2063 Bioinformation 1(9): 351-355 (2007) www.bioinformation.net Given f:R(A1, ...,An)→Y and S ⊆ Y, the (uncompressed, single node-level) Predicate-tree Pf, S is the bitmap, Pf,S(x)=1 (i.e., true) iff f(x)∈S, ∀x∈R. Note that Pf,S bitmaps the set, F-contour({1}) under the function, F(x) = 1 if f(x)∈S else F(x)=0. In Mathematical terms, F is the Characteristic function of the contour, f(S). F can also be viewed as the S-set containment predicate. Pf,S is called a P-tree for short and is just the existential R*-bit map of S ⊆R*.Af. The Compressed P-tree, Pf,S is the compression of Pf,S with equi-width leaf size, s, as follows.